Fast amplification of QMA
نویسندگان
چکیده
Given a verifier circuit for a problem in QMA, we show how to exponentially amplify the gap between its acceptance probabilities in the ‘yes’ and ‘no’ cases, with a method that is quadratically faster than the procedure given by Marriott and Watrous [1]. Our construction is natively quantum, based on the analogy of a product of two reflections and a quantum walk. Second, in some special cases we show how to amplify the acceptance probability for good witnesses to 1, making a step towards the proof that QMA with one-sided error (QMA1) is equal to QMA. Finally, we simplify the filter-state method to search for QMA witnesses by Poulin and Wocjan [2].
منابع مشابه
On QMA protocols with two short quantum proofs
The quantum complexity class QMA [9, 10, 16] is a quantum analogue of the complexity class NP (or of the class MA). That is, a decision problem is in QMA if there is a polynomial-time quantum algorithm V (called the verifier) that satisfies the following two properties: (completeness) V accepts any yes-instance with probability ≥ a by the help of a quantum state (called a quantum proof); (sound...
متن کاملSpace-Efficient Error Reduction for Unitary Quantum Computations
This paper presents a general space-efficient method for error reduction for unitary quantum computation. Consider a polynomial-time quantum computation with completeness c and soundness s, either with or without a witness (corresponding to QMA and BQP, respectively). To convert this computation into a new computation with error at most 2−p, the most space-efficient method known requires extra ...
متن کاملQuantum Certificate Verification: Single versus Multiple Quantum Certificates
The class MA consists of languages that can be efficiently verified by classical probabilistic verifiers using a single classical certificate, and the class QMA consists of languages that can be efficiently verified by quantum verifiers using a single quantum certificate. Suppose that a verifier receives not only one but multiple certificates. In the classical setting, it is obvious that a clas...
متن کامل3-local Hamiltonian is QMA-complete
It has been shown by Kitaev that the 5-local Hamiltonian problem is QMA-complete. Here we reduce the locality of the problem by showing that 3-local Hamiltonian is already QMA-complete.
متن کاملQMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols
This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show that there is no way to pack an exponential number of bits into a polynomial-size quantum state, in such a way that the value of any one of those bits can later be proven with the help of a polynomial-size quantum witness. We also show that any problem in QMA with polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information & Computation
دوره 9 شماره
صفحات -
تاریخ انتشار 2011